Gradual pairwise comparison and stochastic choice
نویسندگان
چکیده
منابع مشابه
Choice Procedures in Pairwise Comparison Multiple-Attribute Decision Making Methods
We consider extensions of some classical rational axioms introduced in conventional choice theory to valued preference relations. The concept of kernel is revisited using two ways: one proposes to determine kernels with a degree of qualification and the other presents a fuzzy kernel where every element of the support belongs to the rational choice set with a membership degree. Links between the...
متن کاملPairwise Choice Markov Chains
As datasets capturing human choices grow in richness and scale—particularly in online domains—there is an increasing need for choice models that escape traditional choice-theoretic axioms such as regularity, stochastic transitivity, and Luce’s choice axiom. In this work we introduce the Pairwise Choice Markov Chain (PCMC) model of discrete choice, an inferentially tractable model that does not ...
متن کاملPairwise RNA Structure Comparison with Stochastic Context-Free Grammars
Pairwise stochastic context-free grammars ("Pair SCFGs") are powerful tools for finding conserved RNA structures, but unconstrained alignment to Pair SCFGs is prohibitively expensive. We develop versions of the Pair SCFG dynamic programming algorithms that can be conditioned on precomputed structures, significantly reducing the time complexity of alignment. We have implemented these algorithms ...
متن کاملStochastic pairwise alignments
MOTIVATION The level of sequence conservation between related nucleic acids or proteins often varies considerably along the sequence. Both regions with high variability (mutational hot-spots) and regions of almost perfect sequence identity may occur in the same pair of molecules. The reliability of an alignment therefore strongly depends on the level of local sequence similarity. Especially in ...
متن کاملMarkov Chain Choice Model from Pairwise Comparisons
Recently, the Markov chain choice model has been introduced by Blanchet et al. to overcome the computational intractability for learning and revenue management for several modern choice models, including the mixed multinomial logit models. However, the known methods for learning the Markov models require almost all items to be offered in the learning stage, which is impractical. To address this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2020
ISSN: 1933-6837
DOI: 10.3982/te3647